Dimensionality Reduction for Similarity Searching in Dynamic Databases
نویسندگان
چکیده
منابع مشابه
Techniques for Similarity Searching in Multimedia Databases
Important task when trying to find patterns in applications involving mining different types of data such as images, video, time series, text documents, DNA sequences, etc. Similarity searching module is a central component of content-based retrieval in multimedia databases Problem: finding objects in a data set S that are similar to a query object q based on some distance measure d which is us...
متن کاملA Simple Dimensionality Reduction Technique for Fast Similarity Search in Large Time Series Databases
We address the problem of similarity search in large time series databases. We introduce a novel-dimensionality reduction technique that supports an indexing algorithm that is more than an order of magnitude faster than the previous best known method. In addition to being much faster our approach has numerous other advantages. It is simple to understand and implement, allows more flexible dista...
متن کاملSimilarity Searching in Medical Image Databases
We propose a method to handle approximate searching by image content in medical image databases. Image content is represented by attributed relational graphs holding features of objects and relationships between objects. The method relies on the assumption that a fixed number of “labeled” or “expected” objects (e.g., “heart”, “lungs” etc.) are common in all images of a given application domain ...
متن کاملDimensionality Reduction using Similarity-induced Embeddings
The vast majority of dimensionality reduction (DR) techniques rely on the second-order statistics to define their optimization objective. Even though this provides adequate results in most cases, it comes with several shortcomings. The methods require carefully designed regularizers and they are usually prone to outliers. In this paper, a new DR framework that can directly model the target dist...
متن کاملPractical Hash Functions for Similarity Estimation and Dimensionality Reduction
Hashing is a basic tool for dimensionality reduction employed in several aspects of machine learning. However, the perfomance analysis is often carried out under the abstract assumption that a truly random unit cost hash function is used, without concern for which concrete hash function is employed. The concrete hash function may work fine on sufficiently random input. The question is if they c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Vision and Image Understanding
سال: 1999
ISSN: 1077-3142
DOI: 10.1006/cviu.1999.0762